Improved Combinatorial Group Testing Algorithms for Real‐World Problem Sizes
نویسندگان
چکیده
منابع مشابه
Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes
We study practically efficient methods for performing combinatorial group testing. We present efficient non-adaptive and two-stage combinatorial group testing algorithms, which identify the at most d items out of a given set of n items that are defective, using fewer tests for all practical set sizes. For example, our two-stage algorithm matches the information theoretic lower bound for the num...
متن کاملImproved Combinatorial Group Testing for Real-World Problem Sizes
We study practically efficient methods for performing combinatorial group testing. We present efficient non-adaptive and two-stage combinatorial group testing algorithms, which identify the at most d items out of a given set of n items that are defective, using fewer tests for all practical set sizes. For example, our two-stage algorithm matches the information theoretic lower bound for the num...
متن کاملImproved Combinatorial Algorithms for the Inhomogeneous Short Integer Solution Problem
The paper is about algorithms for the inhomogeneous short integer solution problem: Given (A, s) to find a short vector x such that Ax ≡ s (mod q). We consider algorithms for this problem due to Camion and Patarin; Wagner; Schroeppel and Shamir; Minder and Sinclair; Howgrave-Graham and Joux (HGJ); Becker, Coron and Joux (BCJ). Our main results include: Applying the Hermite normal form (HNF) to ...
متن کاملQuantum algorithms for search with wildcards and combinatorial group testing
We consider two combinatorial problems. The first we call “search with wildcards”: given an unknown n-bit string x, and the ability to check whether any subset of the bits of x is equal to a provided query string, the goal is to output x. We give an optimal O( √ n) quantum query algorithm for search with wildcards. Rather than using amplitude amplification or a quantum walk, our algorithm is ul...
متن کاملImproved Combinatorial Algorithms for Facility Location Problems
We present improved combinatorial approximation algorithms for the uncapacitated facility location problem. Two central ideas in most of our results are cost scaling and greedy improvement. We present a simple greedy local search algorithm which achieves an approximation ratio of 2.414+ in Õ(n/ ) time. This also yields a bicriteria approximation tradeoff of (1 + γ, 1 + 2/γ) for facility cost ve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2007
ISSN: 0097-5397,1095-7111
DOI: 10.1137/050631847